Polar coding for Ring-LWE-based public key encryption
نویسندگان
چکیده
Abstract The ring learning with errors (RLWE) problem can be used to construct efficient post-quantum public key encryption schemes. An error distribution, normally a Gaussian-like is involved in the RLWE problem. In this work we focus on using polar codes alleviate natural trade-off present schemes; namely, would like wider distribution increase security, but comes at cost of an increased probability decryption error. motivation improve bit-security level by while keeping target failure rate achievable. approach proposed twofold. Firstly, formulate as channel model some noise terms known decoder. This makes our distinguished from existing research kind literature which ignores these terms. Secondly, design for derived model. Theoretically and numerically, show modeling coding scheme contributes considerable improvement compared NewHope, submission National Institute Standards Technology (NIST), almost same parameters. Moreover, encoding decoding support isochronous implementations sense that timings associated operations are irrelevant sensitive information.
منابع مشابه
Better Key Sizes (and Attacks) for LWE-Based Encryption
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contributions are: (1) a new lattice attack on LWE that combines basis reduction with an enumeration algorithm admitting a time/success tradeoff, which performs better than the simple distinguishing attack considered in prior analyses...
متن کاملFully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems on ideal lattices. We then transform it into a fully homomorphic encryption scheme using standard “squashing” and “bootstrapping” techniques introduced by Gentry (STOC 2009). One of the obstacles in going from “somewh...
متن کاملTightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts
We provide a tight security proof for an IND-CCA RingLWE based Key Encapsulation Mechanism that is derived from a generic construction of Dent (IMA Cryptography and Coding, 2003). Such a tight reduction is not known for the generic construction. The resulting scheme has shorter ciphertexts than can be achieved with other generic constructions of Dent or by using the well-known Fujisaki-Okamoto ...
متن کاملCompact-LWE: Enabling Practically Lightweight Public Key Encryption for Leveled IoT Device Authentication
Leveled authentication allows resource-constrained IoT devices to be authenticated at different strength levels according to the particular types of communication. To achieve efficient leveled authentication, we propose a lightweight public key encryption scheme that can produce very short ciphertexts without sacrificing its security. The security of our scheme is based on the Learning With Sec...
متن کاملPublic-key Encryption with Masking Public-key Encryption with Masking
Timed-release encryption, first mentioned by May [12] and discussed by Rivest, Shamir, and Wanger [15], is a cryptographic primitive which enables us to “send a message into the future.” We take a simple approach, called public-key encryption with masking, in order to realize this requirement. In our model, the sender first encrypts a plaintext and “masks” the ciphertext, then send it the recei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography and Communications
سال: 2022
ISSN: ['1936-2455', '1936-2447']
DOI: https://doi.org/10.1007/s12095-022-00607-1